Bounds on 2-query Locally Testable Codes with affine tests
نویسندگان
چکیده
We study Locally Testable Codes (LTCs) that can be tested by making two queries to the tested word using an a ne test. That is, we consider LTCs over a nite eld F, with codeword testers that only use tests of the form avi + bvj = c, where v is the tested word and a, b, c ∈ F. We show that such LTCs, with high minimal distance, must be of constant size. Speci cally, we show that every 2-query LTC with a ne tests over F, that has minimal distance at least 9 10 , completeness at least 1 − , and soundness at most 1− 3 , is of size at most |F|. Our main motivation in studying LTCs with a ne tests is the Unique Games Conjecture (UGC ), and the close connection between LTCs and PCPs. We mention that all known PCP constructions use LTCs with corresponding properties as building blocks, and that many of the LTCs used in PCP constructions are a ne. Furthermore, the UGC was shown to be equivalent to the UGC with a ne tests [13], thus the UGC implies the existence of a low-error 2-query PCP with a ne tests.
منابع مشابه
Limits on the Rate of Locally Testable Affine-Invariant Codes
Despite its many applications, to program checking, probabilistically checkable proofs, locally testable and locally decodable codes, and cryptography, “algebraic property testing” is not well-understood. A significant obstacle to a better understanding, was a lack of a concrete definition that abstracted known testable algebraic properties and reflected their testability. This obstacle was rem...
متن کاملBounds on 2-Query Locally Testable Codes with A ne Tests†
We study Locally Testable Codes (LTCs) that can be tested by making two queries to the tested word using an a ne test. That is, we consider LTCs over a nite eld F, with codeword testers that only use tests of the form avi + bvj = c, where v is the tested word and a, b, c ∈ F. We show that such LTCs, with high minimal distance, must be of constant size. Speci cally, we show that every 2-query LT...
متن کاملLocal Testing for Membership in Lattices
Testing membership in lattices is of practical relevance, with applications to integer programming, error detection in lattice-based communication and cryptography. In this work, we initiate a systematic study of local testing for membership in lattices, complementing and building upon the extensive body of work on locally testable codes. In particular, we formally define the notion of local te...
متن کاملBounds on 2-Query Codeword Testing
We present upper bounds on the size of codes that are locally testable by querying only two input symbols. For linear codes, we show that any 2-locally testable code with minimal distance δn over any finite field F cannot have more than |F| codewords. This result holds even for testers with two-sided error. For general (non-linear) codes we obtain the exact same bounds on the code size as a fun...
متن کاملTowards Lower Bounds on Locally Testable Codes
1 Abbreviations and Notations 3 1 General Introduction 4 1.1 PCP theorem . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.2 Property Testing . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.3 Locally Testable Codes . . . . . . . . . . . . . . . . . . . . . . 6 1.3.1 Random locally testable codes . . . . . . . . . . . . . 6 1.3.2 Algebraic Construction of LTCs . . . . . . . . . . ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 116 شماره
صفحات -
تاریخ انتشار 2009